A construction of Abelian non-cyclic orbit codes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cyclic Orbit Codes with the Normalizer of a Singer Subgroup

An algebraic construction for constant dimension subspace codes is called orbit code. It arises as the orbits under the action of a subgroup of the general linear group on subspaces in an ambient space. In particular orbit codes of a Singer subgroup of the general linear group has investigated recently. In this paper, we consider the normalizer of a Singer subgroup of the general linear group a...

متن کامل

cyclic orbit codes with the normalizer of a singer subgroup

an algebraic construction for constant dimension subspace codes is called orbit code. it arises as the orbits under the action of a subgroup of the general linear group on subspaces in an ambient space. in particular orbit codes of a singer subgroup of the general linear group has investigated recently. in this paper, we consider the normalizer of a singer subgroup of the general linear group a...

متن کامل

Finite $p$-groups and centralizers of non-cyclic abelian subgroups

A $p$-group $G$ is called a $mathcal{CAC}$-$p$-group if $C_G(H)/H$ is ‎cyclic for every non-cyclic abelian subgroup $H$ in $G$ with $Hnleq‎ ‎Z(G)$‎. ‎In this paper‎, ‎we give a complete classification of‎ ‎finite $mathcal{CAC}$-$p$-groups‎.

متن کامل

Construction of minimal non-abelian left group codes

Algorithms to construct minimal left group codes are provided. These are based on results describing a complete set of orthogonal primitive idempotents in each Wedderburn component of a semisimple finite group algebra FG for a large class of groups G. As an illustration of our methods, alternative constructions to some best linear codes over F2 and F3 are given. Furthermore, we give constructio...

متن کامل

Plücker Embedding of Cyclic Orbit Codes

Cyclic orbit codes are a family of constant dimension codes used for random network coding. We investigate the Plücker embedding of these codes and show how to efficiently compute the Grassmann coordinates of the code words.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Cryptography and Communications

سال: 2018

ISSN: 1936-2447,1936-2455

DOI: 10.1007/s12095-018-0306-5